Ontology engineering is a hard and error-prone task, in which small changes may lead to errors, or even produce an inconsistent ontology. As ontologies grow in size, the need for automated methods for repairing inconsistencies while preserving as much of the original knowledge as possible increases. Most previous approaches to this task are based on removing a few axioms from the ontology to regain consistency. We propose a new method based on weakening these axioms to make them less restrictive, employing (...) the use of refinement operators. We introduce the theoretical framework for weakening DL ontologies, propose algorithms to repair ontologies based on the framework, and provide an analysis of the computational complexity. Through an empirical analysis made over real-life ontologies, we show that our approach preserves significantly more of the original knowledge of the ontology than removing axioms. (shrink)

Axiom weakening is a novel technique that allows for fine-grained repair of inconsistent ontologies. In a multi-agent setting, integrating ontologies corresponding to multiple agents may lead to inconsistencies. Such inconsistencies can be resolved after the integrated ontology has been built, or their generation can be prevented during ontology generation. We implement and compare these two approaches. First, we study how to repair an inconsistent ontology resulting from a voting-based aggregation of views of heterogeneous agents. Second, we prevent the generation of (...) inconsistencies by letting the agents engage in a turn-based rational protocol about the axioms to be added to the integrated ontology. We instantiate the two approaches using real-world ontologies and compare them by measuring the levels of satisfaction of the agents w.r.t. the ontology obtained by the two procedures. (shrink)

We introduce and discuss a knowledge-driven distillation approach to explaining black-box models by means of two kinds of interpretable models. The first is perceptron (or threshold) connectives, which enrich knowledge representation languages such as Description Logics with linear operators that serve as a bridge between statistical learning and logical reasoning. The second is Trepan Reloaded, an ap- proach that builds post-hoc explanations of black-box classifiers in the form of decision trees enhanced by domain knowledge. Our aim is, firstly, to target (...) a model-agnostic distillation approach exemplified with these two frameworks, secondly, to study how these two frameworks interact on a theoretical level, and, thirdly, to investigate use-cases in ML and AI in a comparative manner. Specifically, we envision that user-studies will help determine human understandability of explanations generated using these two frameworks. (shrink)

Ontologies represent principled, formalised descriptions of agents’ conceptualisations of a domain. For a community of agents, these descriptions may differ among agents. We propose an aggregative view of the integration of ontologies based on Judgement Aggregation (JA). Agents may vote on statements of the ontologies, and we aim at constructing a collective, integrated ontology, that reflects the individual conceptualisations as much as possible. As several results in JA show, many attractive and widely used aggregation procedures are prone to return inconsistent (...) collective ontologies. We propose to solve the possible inconsistencies in the collective ontology by applying suitable weakenings of axioms that cause inconsistencies. (shrink)

Axiom weakening is a technique that allows for a fine-grained repair of inconsistent ontologies. Its main advantage is that it repairs on- tologies by making axioms less restrictive rather than by deleting them, employing the use of refinement operators. In this paper, we build on pre- viously introduced axiom weakening for ALC, and make it much more irresistible by extending its definitions to deal with SROIQ, the expressive and decidable description logic underlying OWL 2 DL. We extend the definitions of (...) refinement operator to deal with SROIQ constructs, in particular with role hierarchies, cardinality constraints and nominals, and illustrate its application. Finally, we discuss the problem of termi- nation of an iterated weakening procedure. (shrink)

We introduce a family of operators to combine Description Logic concepts. They aim to characterise complex concepts that apply to instances that satisfy \enough" of the concept descriptions given. For instance, an individual might not have any tusks, but still be considered an elephant. To formalise the meaning of "enough", the operators take a list of weighted concepts as arguments, and a certain threshold to be met. We commence a study of the formal properties of these operators, and study some (...) variations. The intended applications concern the representation of cognitive aspects of classi cation tasks: the interdependencies among the attributes that de ne a concept, the prototype of a concept, and the typicality of the instances. (shrink)

When people combine concepts these are often characterised as “hybrid”, “impossible”, or “humorous”. However, when simply considering them in terms of extensional logic, the novel concepts understood as a conjunctive concept will often lack meaning having an empty extension (consider “a tooth that is a chair”, “a pet flower”, etc.). Still, people use different strategies to produce new non-empty concepts: additive or integrative combination of features, alignment of features, instantiation, etc. All these strategies involve the ability to deal with conflicting (...) attributes and the creation of new (combinations of) properties. We here consider in particular the case where a Head concept has superior ‘asymmetric’ control over steering the resulting concept combination (or hybridisation) with a Modifier concept. Specifically, we propose a dialogical approach to concept combination and discuss an implementation based on axiom weakening, which models the cognitive and logical mechanics of this asymmetric form of hybridisation. (shrink)

We discuss the role of perceptron (or threshold) connectives in the context of Description Logic, and in particular their possible use as a bridge between statistical learning of models from data and logical reasoning over knowledge bases. We prove that such connectives can be added to the language of most forms of Description Logic without increasing the complexity of the corresponding inference problem. We show, with a practical example over the Gene Ontology, how even simple instances of perceptron connectives are (...) expressive enough to represent learned, complex concepts derived from real use cases. This opens up the possibility to import concepts learnt from data into existing ontologies. (shrink)

Many aspects of how humans form and combine concepts are notoriously difficult to capture formally. In this paper, we focus on the representation of three particular such aspects, namely overexten- sion, underextension, and dominance. Inspired in part by the work of Hampton, we consider concepts as given through a prototype view, and by considering the interdependencies between the attributes that define a concept. To approach this formally, we employ a recently introduced family of operators that enrich Description Logic languages. These (...) operators aim to characterise complex concepts by collecting those instances that apply, in a finely controlled way, to ‘enough’ of the concept’s defin- ing attributes. Here, the meaning of ‘enough’ is technically realised by accumulating weights of satisfied attributes and comparing with a given threshold that needs to be met. (shrink)

We present an algorithm for concept combination inspired and informed by the research in cognitive and experimental psychology. Dealing with concept combination requires, from a symbolic AI perspective, to cope with competitive needs: the need for compositionality and the need to account for typicality effects. Building on our previous work on weighted logic, the proposed algorithm can be seen as a step towards the management of both these needs. More precisely, following a proposal of Hampton [1], it combines two weighted (...) Description Logic formulas, each defining a concept, using the following general strategy. First it selects all the features needed for the combination, based on the logical distinc- tion between necessary and impossible features. Second, it determines the threshold and assigns new weights to the features of the combined concept trying to preserve the relevance and the necessity of the features. We illustrate how the algorithm works exploiting some paradigmatic examples discussed in the cognitive literature. (shrink)

We study a fragment of Intuitionistic Linear Logic combined with non-normal modal operators. Focusing on the minimal modal logic, we provide a Gentzen-style sequent calculus as well as a semantics in terms of Kripke resource models. We show that the proof theory is sound and complete with respect to the class of minimal Kripke resource models. We also show that the sequent calculus allows cut elimination. We put the logical framework to use by instantiating it as a logic of agency. (...) In particular, we apply it to reason about the resource-sensitive use of artefacts. (shrink)

We show that logic has more to offer to ontologists than standard first order and modal operators. We first describe some operators of linear logic which we believe are particularly suitable for ontological modeling, and suggest how to interpret them within an ontological framework. After showing how they can coexist with those of classical logic, we analyze three notions of artifact from the literature to conclude that these linear operators allow for reducing the ontological commitment needed for their formalization, and (...) even simplify their logical formulation. (shrink)

In recent years, there has been an increasing interest in thedevelopment of ontologically well-founded conceptual models for Information Systems in areas such as Service Management, Accounting Information Systems and Financial Reporting. Economic exchanges are central phenomena in these areas. For this reason, they occupy a prominent position in modelling frameworks such as the REA (Resource-EventAction) ISO Standard as well as the FIBO (Financial Industry BusinessOntology). In this paper, we begin a well-founded ontological analysisof economic exchanges inspired by a recent ontological (...) view on the nature of economic transactions. According to this view, what counts asan economic transaction is based on an agreement on the actions thatthe agents are committed to perform. The agreement is in turn based on convergent preferences about the course of action to bring about. This view enables a unified treatment of economic exchanges, regardless the object of the transaction, and complies with the view that all economictransactions are about services. In this paper, we start developing our analysis in the framework of the Unified Foundational Ontology (UFO). (shrink)

Informally speaking, a truthmaker is something in the world in virtue of which the sentences of a language can be made true. This fundamental philosophical notion plays a central role in applied ontology. In particular, a recent nonorthodox formulation of this notion proposed by the philosopher Josh Parsons, which we labelled weak truthamking, has been shown to be extremely useful in addressing a number of classical problems in the area of Conceptual Modeling. In this paper, after revisiting the classical notion (...) of truthmaking, we conduct an in depth analysis of Parsons’ account of weak truthmaking. By doing that, we expose some difficulties in his original formulation. As the main contribution of this paper, we propose solutions to address these issues which are then integrated in a new precise interpretation of truthmaking that is harmonizable with. (shrink)

It is widely recognized that accurately identifying and classifying competitors is a challenge for many companies and entrepreneurs. Nonetheless, it is a paramount activity which provide valuable insights that affect a wide range of strategic decisions. One of the main challenges in competitor identification lies in the complex nature of the competitive relationships that arise in business envi- ronments. These have been extensively investigate over the years, which lead to a plethora of competition theories and frameworks. Still, the concept of (...) competition remains conceptually complex, as none of these approaches properly formalized their assumptions. In this paper, we address this issue by means of an ontological analysis on the notion of competition in general, and of business competition, in particular, leveraging theories from various fields, including Marketing, Strategic Management, Ecology, Psychology and Cognitive Sciences. Our analysis, the first of its kind in the literature, is grounded on the Unified Foundational Ontology (UFO) and allows us to formally characterize why competition arises, as well as to distinguish between three types of business competitive relationships, namely market-level, firm-level and potential competition. (shrink)

dolce, the first top-level ontology to be axiomatized, has remained stable for twenty years and today is broadly used in a variety of domains. dolce is inspired by cognitive and linguistic considerations and aims to model a commonsense view of reality, like the one human beings exploit in everyday life in areas as diverse as socio-technical systems, manufacturing, financial transactions and cultural heritage. dolce clearly lists the ontological choices it is based upon, relies on philosophical principles, is richly formalized, and (...) is built according to well-established ontological methodologies, e.g. OntoClean. Because of these features, it has inspired most of the existing top-level ontologies and has been used to develop or improve standards and public domain resources. Being a foundational ontology, dolce is not directly concerned with domain knowledge. Its purpose is to provide the general categories and relations needed to give a coherent view of reality, to integrate domain knowledge, and to mediate across domains. In these 20 years dolce has shown that applied ontologies can be stable and that interoperability across reference and domain ontologies is a reality. This paper briefly introduces the ontology and shows how to use it on a few modeling cases. (shrink)

Throughout the biological and biomedical sciences there is a growing need for, prescriptive ‘minimum information’ (MI) checklists specifying the key information to include when reporting experimental results are beginning to find favor with experimentalists, analysts, publishers and funders alike. Such checklists aim to ensure that methods, data, analyses and results are described to a level sufficient to support the unambiguous interpretation, sophisticated search, reanalysis and experimental corroboration and reuse of data sets, facilitating the extraction of maximum value from data sets (...) them. However, such ‘minimum information’ MI checklists are usually developed independently by groups working within representatives of particular biologically- or technologically-delineated domains. Consequently, an overview of the full range of checklists can be difficult to establish without intensive searching, and even tracking thetheir individual evolution of single checklists may be a non-trivial exercise. Checklists are also inevitably partially redundant when measured one against another, and where they overlap is far from straightforward. Furthermore, conflicts in scope and arbitrary decisions on wording and sub-structuring make integration difficult. This presents inhibit their use in combination. Overall, these issues present significant difficulties for the users of checklists, especially those in areas such as systems biology, who routinely combine information from multiple biological domains and technology platforms. To address all of the above, we present MIBBI (Minimum Information for Biological and Biomedical Investigations); a web-based communal resource for such checklists, designed to act as a ‘one-stop shop’ for those exploring the range of extant checklist projects, and to foster collaborative, integrative development and ultimately promote gradual integration of checklists. (shrink)

For over a decade now, a community of researchers has contributed to the development of the Unified Foundational Ontology (UFO) - aimed at providing foundations for all major conceptual modeling constructs. This ontology has led to the development of an Ontology-Driven Conceptual Modeling language dubbed OntoUML, reflecting the ontological micro-theories comprising UFO. Over the years, UFO and OntoUML have been successfully employed in a number of academic, industrial and governmental settings to create conceptual models in a variety of different domains. (...) These experiences have pointed out to opportunities of improvement not only to the language itself but also to its underlying theory. In this paper, we take the first step in that direction by revising the theory of types in UFO in response to empirical evidence. The new version of this theory shows that many of the meta-types present in OntoUML (differentiating Kinds, Roles, Phases, Mixins, etc.) should be considered not as restricted to Substantial types but instead should be applied to model Endurant Types in general, including Relator types, Quality types and Mode types. We also contribute a formal characterization of this fragment of the theory, which is then used to advance a metamodel for OntoUML 2.0. Finally, we propose a computational support tool implementing this updated metamodel. (shrink)

Economics has developed into one of the most specialised social sciences. Yet at the same time, it shares its subject matter with other social sciences and humanities and its method of analysis has developed in close correspondence with the natural and life sciences. This book offers an up to date assessment of economics in relation to other disciplines. -/- This edited collection explores fields as diverse as mathematics, physics, biology, medicine, sociology, architecture, and literature, drawing from selected contributions to the (...) 2005 Annual Conference of the European Society for the History of Economic Thought (ESHET). There is currently much discussion at the leading edges of modern economics about openness to other disciplines, such as psychology and sociology. But what we see here is that economics has drawn on (as well as contributed to) other disciplines throughout its history. In this sense, in spite of the increasing specialisation within all disciplines, economics has always been an open discipline and the chapters in this volume provide a vivid illustration for this. -/- Open Economics is a testament to the intellectual vibrancy of historical research in economics. It presents the reader with a historical introduction to the disciplinary context of economics that is the first of its kind, and will appeal to practising economists and students of the discipline alike, as well as to anybody interested in economics and its position in the scientific and social scientific landscape. -/- Table of Contents -/- Introduction: Economics in relation to other disciplines Richard Arena, Sheila Dow and Matthias Klaes Part I. Economics in relation to the humanities and social sciences 1. The social science of economics Brian J. Loasby 2. Economics and literature Bruna Ingrao 3. Happiness: what Kahneman could have learnt from Pietro Verri Pier Luigi Porta Part II. Economics in relation to the life and natural sciences 4. Newtonian physics, experimental moral philosophy and the shaping of political economy Sergio Cremaschi 5. Evolutionary biology and economic behaviour: re-visiting Veblen's instinct of workmanship Mark Harrison 6. Medicine and economics in pre-classical economics Alain Clément and Ludovic Desmedt Part III. Economics and mathematics 7. Mathematics as the role model for neoclassical economics Nicola Giocoli 8. The role of econometric method in economic analysis: A reassessment of the Keynes-Tinbergen debate, 1938-43 Giovanna Garrone and Roberto Marchionatti IV. Economics and architecture 9. Economics and architecture Maurice Lagueux 10. Economic policies and urban development in Latin America Michele Alacevich and Andrea Costa V. Economics and geography 11. ‘Space’ in economic thought Giovanna Vertova 12. Economics, geography and colonialism in the writings of William Petty Hugh Goodacre Part VI. Economics and sociology 13. Economics and sociology: Gustav Schmoller and Werner Sombart on social differentiation Joachim Zweynert 14. Is Homo Oeconomicus a 'bad guy'? Isabelle This Saint-Jean -/- . (shrink)

La figura de Roberto Navarrete Troncoso fue parte fundamental del Teatro de la Universidad de Concepción, porque contribuyó desde la escena -como actor, director y dramaturgo- en el desarrollo artístico de un elenco que fue motor importante del crecimiento cultural de la ciudad, pero también del país. El artículo se propone levantar su obra del olvido. Para ello analiza Su día gris desde el comentario dramatológico. Se afirma que la obra está en sintonía con una vertiente de la dramaturgia (...) chilena de comienzos de 1960, en que los dramaturgos escenifican la crisis de la vida y valores de una clase media citadina. (shrink)

While dreaming amputees often experience a normal body image and the phantom limb may not be present. However, dreaming experiences in amputees have mainly been collected by questionnaires. We analysed the dream reports of amputated patients with phantom limb collected after awakening from REM sleep during overnight videopolysomnography . Six amputated patients underwent overnight VPSG study. Patients were awakened during REM sleep and asked to report their dreams. Three patients were able to deliver an account of a dream. In all (...) dreaming recalls, patients reported that the amputated limbs were intact and completely functional and they no longer experienced phantom limb sensations. Phantom limb experiences, that during wake result from a conflict between a pre-existing body scheme and the sensory information on the missing limb, were suppressed during sleep in our patients in favour of the image of an intact body accessed during dream. (shrink)

The properties of the ${\forall^{1}}$ quantifier defined by Kontinen and Väänänen in [13] are studied, and its definition is generalized to that of a family of quantifiers ${\forall^{n}}$ . Furthermore, some epistemic operators δ n for Dependence Logic are also introduced, and the relationship between these ${\forall^{n}}$ quantifiers and the δ n operators are investigated.The Game Theoretic Semantics for Dependence Logic and the corresponding Ehrenfeucht- Fraissé game are then adapted to these new connectives.Finally, it is proved that the ${\forall^{1}}$ quantifier (...) is not uniformly definable in Dependence Logic, thus answering a question posed by Kontinen and Väänänen in the above mentioned paper. (shrink)

We develop a semantics for independence logic with respect to what we will call general models. We then introduce a simpler entailment semantics for the same logic, and we reduce the validity problem in the former to the validity problem in the latter. Then we build a proof system for independence logic and prove its soundness and completeness with respect to entailment semantics.

We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We prove that the logic is decidable, and give a (...) complete axiomatization. To demonstrate the value of the logic, we show in particular how it can be applied to the problem of determining whether a social choice function is strategy-proof. (shrink)

We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We prove that the logic is decidable, and give a (...) complete axiomatization. To demonstrate the value of the logic, we show in particular how it can be applied to the problem of determining whether a social choice function is strategy-proof. (shrink)

In [STU 00, KUT 03] we introduced a family of ‘modal' languages intended for talking about distances. These languages are interpreted in ‘distance spaces' which satisfy some of the standard axioms of metric spaces. Among other things, we singled out decidable logics of distance spaces and proved expressive completeness results relating classical and modal languages. The aim of this paper is to axiomatize the modal fragments of the semantically defined distance logics of [KUT 03] and give a new proof of (...) their decidability. (shrink)

We examine the transitions between sets of possible worlds described by the compositional semantics of Modal Dependence Logic, and we use them as the basis for a dynamic version of this logic. We give a game theoretic semantics, a (compositional) transition semantics and a power game semantics for this new variant of modal Dependence Logic, and we prove their equivalence; and furthermore, we examine a few of the properties of this formalism and show that Modal Dependence Logic can be recovered (...) from it by reasoning in terms of reachability. Then we show how we can generalize this approach to a very general formalism for reasoning about transformations between pointed Kripke models. (shrink)

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of linear logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have shown that the results scale up to logics with multiple non-minimal modalities. Here, we start with the language of propositional intuitionistic linear logic without the additive disjunction, to which we add a modality. We provide an interpretation of this language on a class of Kripke resource models (...) extended with a neighbourhood function: modal Kripke resource models. We propose a Hilbert-style axiomatisation and a Gentzen-style sequent calculus. We show that the proof theories are sound and complete with respect to the class of modal Kripke resource models. We show that the sequent calculus admits cut elimination and that proof-search is in PSPACE. We then show how to extend the results when non-commutative connectives are added to the language. Finally, we put the l.. (shrink)

In [14], we studied the computational behaviour of various first-order and modal languages interpreted in metric or weaker distance spaces. [13] gave an axiomatisation of an expressive and decidable metric logic. The main result of this paper is in showing that the technique of representing metric spaces by means of Kripke frames can be extended to cover the modal (hybrid) language that is expressively complete over metric spaces for the (undecidable) two-variable fragment of first-order logic with binary pred-icates interpreting the (...) metric. The frame conditions needed correspond rather directly with a Boolean modal logic that is, again, of the same expressivity as the two-variable fragment. We use this representation to derive an axiomatisation of the modal hybrid variant of the two-variable fragment, discuss the compactness property in distance logics, and derive some results on (the failure of) interpolation in distance logics of various expressive power. (shrink)

s for the Second Workshop on Implementing Machine Ethics.

We present a compositional semantics for first-order logic with imperfect information that is equivalent to Sevenster and Sandu’s equilibrium semantics (under which the truth value of a sentence in a finite model is equal to the minimax value of its semantic game). Our semantics is a generalization of an earlier semantics developed by the first author that was based on behavioral strategies, rather than mixed strategies.